5-stars of Low Weight in Normal Plane Maps with Minimum Degree 5
نویسندگان
چکیده
It is known that there are normal plane maps M5 with minimum degree 5 such that the minimum degree-sum w(S5) of 5-stars at 5-vertices is arbitrarily large. In 1940, Lebesgue showed that if an M5 has no 4-stars of cyclic type (5, 6, 6, 5) centered at 5-vertices, then w(S5) ≤ 68. We improve this bound of 68 to 55 and give a construction of a (5, 6, 6, 5)-free M5 with w(S5) = 48.
منابع مشابه
Short cycles of low weight in normal plane maps with minimum degree 5
In this note, precise upper bounds are determined for the minimum degree-sum of the vertices of a 4-cycle and a 5-cycle in a plane triangulation with minimum degree 5: w(C4) ≤ 25 and w(C5) ≤ 30. These hold because a normal plane map with minimum degree 5 must contain a 4-star with w(K1,4) ≤ 30. These results answer a question posed by Kotzig in 1979 and recent questions of Jendrol’ and Madaras.
متن کاملMinor stars in plane graphs with minimum degree five
The weight of a subgraph H in G is the degree-sum of vertices of H in G. LetΩ∆ be the minimum integer such that there is a minor 5-star with weight at mostΩ∆ in every plane graph with minimum degree five and maximum degree ∆. Borodin and Ivanova [Discrete Math. 340 (2017) 2234–2242] proved that Ω∆ ≤ ∆ + 29 for ∆ ≥ 13. They also asked: what’s the minimum integer ∆0 such that Ω∆ ≤ ∆ + 28 whenever...
متن کاملNote on the weight of paths in plane triangulations of minimum degree 4 and 5
The weight of a path in a graph is defined to be the sum of degrees of its vertices in entire graph. It is proved that each plane triangulation of minimum degree 5 contains a path P5 on 5 vertices of weight at most 29, the bound being precise, and each plane triangulation of minimum degree 4 contains a path P4 on 4 vertices of weight at most 31.
متن کاملLight stars in large polyhedral maps on surfaces
It is well known that every polyhedral map with large enough number of vertices contains a vertex of degree at most 6. In this paper the existence of stars having low degree sum of their vertices in polyhedral maps is investigated. We will prove: if G is a polyhedral map on compact 2-manifold M with non-positive Euler characteristic (M) and G has more than 149| (M)| vertices then G contains an ...
متن کاملWeight of 3-Paths in Sparse Plane Graphs
We prove precise upper bounds for the minimum weight of a path on three vertices in several natural classes of plane graphs with minimum degree 2 and girth g from 5 to 7. In particular, we disprove a conjecture by S. Jendrol’ and M. Maceková concerning the case g = 5 and prove the tightness of their upper bound for g = 5 when no vertex is adjacent to more than one vertex of degree 2. For g > 8,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 34 شماره
صفحات -
تاریخ انتشار 2014